Approximation Algorithms for Facility Location Problems
نویسنده
چکیده
This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005.
منابع مشابه
Approximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...
متن کاملInverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملApproximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions Approximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions
In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1 + , 1)-reduction of the facility location problem with subadditive costs to a soft capacitated facility location problem, which i...
متن کاملDistributed Approximation Algorithms for Facility Location Problems
In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facilit...
متن کاملApproximation Algorithms for Metric Facility Location Problems
In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...
متن کامل